package algorithm.swordoff;

public class SQ17 {
    public int[] printNumbers(int n) {
        int length = (int) Math.pow(10, n) - 1;
        int[] ans = new int[length];
        for (int i = 0; i < ans.length; i++) {
            ans[i] = i+1;
        }
        return ans;
    }
}
